Automatic Synthesis of Assumptions for Compositional Model Checking? Bernd Finkbeiner1 , Sven Schewe1 , and Matthias Brill2 1 Universit¨

Source URL: cgi.csc.liv.ac.uk

Experience with Model Checking Linearizability Martin Vechev, Eran Yahav, and Greta Yorsh IBM T.J. Watson Research Center Non-blocking concurrent algorithms offer significant performance advantages, but are very difficul

Source URL: www.cs.technion.ac.il

• Transaction processing
• Memory management
• Linearizability
• Parallel computing
• Concurrent data structure
• Non-blocking algorithm
• Garbage collection
• Algorithm
• Sequential consistency
• Computing
• Concurrent computing
• Concurrency control

Decision Procedures for CTL∗ Oliver Friedmann and Markus Latte Dept. of Computer Science, University of Munich, Germany Abstract. We give an overview over three serious attempts to devise an effective decision method

Source URL: files.oliverfriedmann.de

• Mathematics
• CTL*
• Method of analytic tableaux
• Formal language
• Model checking
• Temporal logic
• Finite-state machine
• Tree automaton
• Powerset construction
• Automata theory
• Theoretical computer science
• Applied mathematics

Specifying and Verifying Concurrent C Programs with TLA+ Amira Methni1,4(B) , Matthieu Lemerre2 , Belgacem Ben Hedia1 , Serge Haddad3 , and Kamel Barkaoui4 1

Source URL: www.lsv.ens-cachan.fr

• Computer programming
• Data types
• Call stack
• Stack
• Model checking
• Pointer
• Temporal logic of actions
• Final
• Software engineering
• Computing
• Subroutines

Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic Viktor Kuncak1 and Martin Rinard2 1 Ecole Politechnique F´ed´erale de Lausanne, Lausanne, VD, Switzerland

Source URL: lara.epfl.ch

• Logic in computer science
• Model theory
• Complexity classes
• Boolean algebra
• Electronic design automation
• Boolean satisfiability problem
• Presburger arithmetic
• Quantifier elimination
• Decision problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

ATL* Satisfiability is 2EXPTIME-Complete⋆ Sven Schewe Universit¨ at des Saarlandes, 66123 Saarbr¨ ucken, Germany

Source URL: cgi.csc.liv.ac.uk

• Formal methods
• Model checking
• Entailment
• Boolean satisfiability problem
• Logic
• Theoretical computer science
• Deduction

STEPHEN F. SIEGEL Curriculum Vitæ Department of Computer and Information Sciences 101 Smith Hall University of Delaware

Source URL: vsl.cis.udel.edu

• Concurrent computing
• Application programming interfaces
• Message Passing Interface
• Jack Dongarra
• Model checking
• Formal verification
• Bill Gropp
• Actor model
• Computer cluster
• Computing
• Parallel computing
• Computer programming

1/ ForTesSE Formal Testing and System Exploration Laboratoire de Recherche en Informatiquereport

Source URL: vals.lri.fr

• Software development
• Science
• Model-based testing
• Formal verification
• Model checking
• Software verification
• Verification and validation
• Software development process
• Construction and Analysis of Distributed Processes
• Software testing
• Formal methods
• Theoretical computer science

Symbolic Execution for Software Testing in Practice – Preliminary Assessment Imperial College London Microsoft Research

Source URL: research.microsoft.com

• Computing
• Concolic testing
• Symbolic execution
• Java Pathfinder
• Test Data Generation
• Fuzz testing
• KeY
• Model checking
• Dynamic program analysis
• Software testing
• Formal methods
• Software development

Formal Modeling and Analysis of a Distributed Transaction Protocol in UPPAAL Omar Al-Bataineh Tim French Abstract

Source URL: www.csse.uwa.edu.au

• Data management
• Computing
• Two-phase commit protocol
• Model checking
• Three-phase commit protocol
• Uppaal Model Checker
• Formal verification
• Atomic commit
• Transmission Control Protocol
• Transaction processing
• Data
• Information